Pseudoconvex domains over Grassmann manifolds

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strongly Pseudoconvex Domains as Subvarieties of Complex Manifolds

In this paper – a sequel to [14] – we obtain existence and approximation results for closed complex subvarieties that are normalized by strongly pseudoconvex Stein domains. Our sufficient condition for the existence of such subvarieties in a complex manifold X is expressed in terms of the Morse indices and the number of positive Levi eigenvalues of an exhaustion function on X. Examples show tha...

متن کامل

On Analytic Interpolation Manifolds in Boundaries of Weakly Pseudoconvex Domains

Let Ω be a bounded, weakly pseudoconvex domain in Cn, n ≥ 2, with real-analytic boundary. A real-analytic submanifold M ⊂ ∂Ω is called an analytic interpolation manifold if every real-analytic function on M extends to a function belonging to O(Ω). We provide sufficient conditions for M to be an analytic interpolation manifold. We give examples showing that neither of these conditions can be rel...

متن کامل

Institute for Mathematical Physics Hardy-toeplitz C -algebras over Non-pseudoconvex Domains Hardy-toeplitz C -algebras over Non-pseudoconvex Domains

Let Z be a positive hermitian Jordan triple system and B be any connected component of its regular set. A general framework for studying Hardy spaces and associated Toeplitz operators over B is developed. As application , the full spectrum of all Hardy-Toeplitz C-algebras is constructed for the example Z = Sym(2; C), leading to a complete C-structure theory, described in terms of the facial bou...

متن کامل

Subspace Estimation Using Projection Based M-Estimators over Grassmann Manifolds

We propose a solution to the problem of robust subspace estimation using the projection based M-estimator. The new method handles more outliers than inliers, does not require a user defined scale of the noise affecting the inliers, handles noncentered data and nonorthogonal subspaces. Other robust methods like RANSAC, use an input for the scale, while methods for subspace segmentation, like GPC...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kyoto Journal of Mathematics

سال: 1980

ISSN: 2156-2261

DOI: 10.1215/kjm/1250522285